Towards an Adaptive Approach for Distributed Resource Allocation in a Multi-agent System for Solving Dynamic Vehicle Routing Problems
نویسندگان
چکیده
Introduction. The existing problem of continuous planning in transportation logistics requires the solving of dynamic Vehicle Routing Problems (dynamic VRPs) which is an NP-complete optimization problem. The task of continuous planning assumes the existence of individual commit times for orders to be released for execution with specific commitment strategies and is similar to the problem of maintaining a guaranteed response time in real-time systems that, in a dynamic environment, applies additional restrictions on planning algorithms. This paper describes the developed multi-agent platform for solving the dynamic multi-vehicle pickup and delivery problem with soft time windows (dynamic m-PDPSTW) that supports goaldriven behavior of autonomous agents with a multi-objective decision-making model. Further research on the design of adaptive mechanisms for run-time feedback-directed adjustment of scheduling algorithms through learning and experience of applied decision options is outlined. The market-based method for distributed dynamic resource allocation. The authors’ multi-agent approach to continuous planning in complex uncertain environments implements the concept of the dynamic distributed resource allocation (Modi et al. 2002) whereby decision making is carried out by means of asynchronous quasi-parallel processes of negotiation between the agents of resources and the agents of orders which are working distributively in a virtual marketplace over all the agents of the complex shared ontology object. Goal-driven behavior of autonomous agents is supported by the developed multiobjective decision-making model based on individual goals, criteria, and preference functions defined in the virtual marketplace ontology and methods of agent self-appraisal and decision-making strategies (priority of criteria, value superposition, and homeostasis). In the implemented framework for agent knowledge representation, based on Prof. Marvin Minsky’s concept of frames, each autonomous agent in the virtual marketplace has its individual knowledge, agent memory with a dynamic decision-making table, experience of applied deci-
منابع مشابه
Multi-agent System for Resource Allocation and Scheduling
The paper considers multi agent approach and respective multi-agent system for resource allocation and scheduling within shipping logistics problem. A well known benchmark that is Vehicle Routing Problem with Time Windows is considered as a case study. The paper proposes an approach to the shipping logistics problem solving that includes auction-based resource allocation and scheduling, distrib...
متن کاملA multi-criteria vehicle routing problem with soft time windows by simulated annealing
This paper presents a multi-criteria vehicle routing problem with soft time windows (VRPSTW) to mini-mize fleet cost, routes cost, and violation of soft time windows penalty. In this case, the fleet is heterogene-ous. The VRPSTW consists of a number of constraints in which vehicles are allowed to serve customers out of the desirable time window by a penalty. It is assumed that this relaxation a...
متن کاملUser-based Vehicle Route Guidance in Urban Networks Based on Intelligent Multi Agents Systems and the ANT-Q Algorithm
Guiding vehicles to their destination under dynamic traffic conditions is an important topic in the field of Intelligent Transportation Systems (ITS). Nowadays, many complex systems can be controlled by using multi agent systems. Adaptation with the current condition is an important feature of the agents. In this research, formulation of dynamic guidance for vehicles has been investigated based...
متن کاملAdaptive Distributed Consensus Control for a Class of Heterogeneous and Uncertain Nonlinear Multi-Agent Systems
This paper has been devoted to the design of a distributed consensus control for a class of uncertain nonlinear multi-agent systems in the strict-feedback form. The communication between the agents has been described by a directed graph. Radial-basis function neural networks have been used for the approximation of the uncertain and heterogeneous dynamics of the followers as well as the effect o...
متن کاملA Comparison of NSGA II and MOSA for Solving Multi-depots Time-dependent Vehicle Routing Problem with Heterogeneous Fleet
Time-dependent Vehicle Routing Problem is one of the most applicable but least-studied variants of routing and scheduling problems. In this paper, a novel mathematical formulation of time-dependent vehicle routing problems with heterogeneous fleet, hard time widows and multiple depots, is proposed. To deal with the traffic congestions, we also considered that the vehicles are not forced to come...
متن کامل